On the structured distance to uncontrollability
نویسندگان
چکیده
This article is concerned with the structured distance to uncontrollability of a linear time-invariant system and relates this concept to a variation of the μ-value. The developed framework is applied to derive computational expressions for the class of real perturbations as well as for Hermitian, symmetric, and skew-symmetric perturbations in a relatively simple manner. Examples demonstrate that the structured distance can differ from the standard, unstructured distance to uncontrollability by an arbitrary amount. It is also shown how systems of higher order and periodic systems can be addressed.
منابع مشابه
The structured distance to uncontrollability under multi-perturbations: An approach using multi-valued linear operators
In this paper we develop a unifying approach for computing the distance to uncontrollability of linear control systems. By using multi-valued linear operators in representing and estimating the system's equations and matrices we are able to derive computable formulas of the distance from a controllable linear system to the nearest uncontrollable system under the assumption that the system's mat...
متن کاملComputing the distance to uncontrollability: the SISO case
In this paper, the problem of computing the distance from a given linear time-invariant system to the nearest uncontrollable system is posed and solved in the behavioral setting. In the case of a system with two external variables, the problem is restated as a Sylvester structured distance to singularity problem. The structured distance to singularity problem is then solved by integrating a sys...
متن کاملFast Methods for Estimating the Distance to Uncontrollability
The distance to uncontrollability for a linear control system is the distance (in the 2-norm) to the nearest uncontrollable system. We present an algorithm based on methods of Gu and Burke–Lewis–Overton that estimates the distance to uncontrollability to any prescribed accuracy. The new method requires O(n4) operations on average, which is an improvement over previous methods which have complex...
متن کاملPseudospectral Components and the Distance to Uncontrollability
We show that 2-norm pseudospectra ofm-by-nmatrices have no more than 2m(4m−1) connected components. Such bounds are pertinent for computing the distance to uncontrollability of a control system, since this distance is the minimum value of a function whose level sets are pseudospectra. We also discuss algorithms for computing this distance, including a trisection variant of Gu’s recent algorithm...
متن کاملComputing the distance to uncontrollability via LMIs: Lower bound computation with exactness verification
In this paper, we consider the problem to compute the distance to uncontrollability (DTUC) of a given controllable pair A ∈ Cn×n and B ∈ Cn×m. It is known that this problem is equivalent to computing the minimum of the smallest singular value of [ A − zI B ] over z ∈ C. With this fact, Gu et al. proposed an algorithm that correctly estimates the DTUC at a computation cost O(n4). From the viewpo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Systems & Control Letters
دوره 58 شماره
صفحات -
تاریخ انتشار 2009